#include <iostream>
#include <vector>

using namespace std;

class A { 

public: 
    A() {} 

    A(int) = delete; 

};

class Solution {
public:
    int uniquePaths(int m, int n) 
    {

        vector<vector<int>> dp(m + 1, vector<int>(n + 1));
        dp[0][1] = 1;

        for (int i = 1; i < m + 1; i++)
        {
            for (int j = 1; j < n + 1; j++)
            {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }

        return dp[m][n];
    }
};

int main()
{
    //error
    //short s{ 65535 };
    A a;

    return 0;
}